Exploitation of temporal redundancy in compressed sensing reconstruction of fMRI studies with a prior-based algorithm (PICCS).

PURPOSE: Compressed sensing is a technique used to accelerate magnetic resonance imaging (MRI) acquisition without compromising image quality. While it has proven particularly useful in dynamic imaging procedures such as cardiac cine, very few authors have applied it to functional magnetic resonance imaging (fMRI). The purpose of the present study was to check whether the prior image constrained compressed sensing (PICCS) algorithm, which is based on an available prior image, can improve the statistical maps in fMRI better than other strategies that also exploit temporal redundancy. METHODS: PICCS was compared to spatiotemporal total variation (TTV) and k-t FASTER, since they have already demonstrated high performance and robustness in other MRI applications, such as cardiac cine MRI and resting state fMRI, respectively. The prior image for PICCS was the average of all undersampled data. Both PICCS and TTV were solved using the split Bregman formulation. K-t FASTER algorithm relies on matrix completion to reconstruct the undersampled k-spaces. The three algorithms were evaluated using two datasets with high and low signal-to-noise ratio (SNR)-BOLD contrast-acquired in a 7 T preclinical MRI scanner and retrospectively undersampled at various rates (i.e., acceleration factors). The authors evaluated their performance in terms of the sensitivity/specificity of BOLD detection through receiver operating characteristic curves and by visual inspection of the statistical maps. RESULTS: With high SNR studies, PICCS performed similarly to the state-of-the-art algorithms TTV and k-t FASTER and provided consistent BOLD signal at the ROI. In scenarios with low SNR and high acceleration factors, PICCS still provided consistent maps and higher sensitivity/specificity than TTV, whereas k-t FASTER failed to provide significant maps. CONCLUSIONS: The authors performed a comparison between three reconstructions (PICCS, TTV, and k-t FASTER) that exploit temporal redundancy in fMRI. The prior-based algorithm, PICCS, preserved BOLD activation and sensitivity/specificity better than TTV and k-t FASTER in noisy scenarios. The PICCS algorithm can potentially reach an acceleration factor of ×8 and still provide BOLD contrast in the ROI with an area under the curve over 0.99.

Fluorescence diffuse optical tomography using the split Bregman method.

PURPOSE: Standard image reconstruction methods for fluorescence Diffuse Optical Tomography (fDOT) generally make use of L2-regularization. A better choice is to replace the L2 by a total variation functional that effectively removes noise while preserving edges. Among the wide range of approaches available, the recently appeared Split Bregman method has been shown to be optimal and efficient. Furthermore, additional constraints can be easily included. We propose the use of the Split Bregman method to solve the image reconstruction problem for fDOT with a nonnegativity constraint that imposes the reconstructed concentration of fluorophore to be positive. METHODS: The proposed method is tested with simulated and experimental data, and results are compared with those yielded by an equivalent unconstrained optimization approach based on Gauss-Newton (GN) method, in which the negative part of the solution is projected to zero after each iteration. In addition, the method dependence on the parameters that weigh data fidelity and nonnegativity constraints is analyzed. RESULTS: Split Bregman yielded a reduction of the solution error norm and a better full width at tenth maximum for simulated data, and higher signal-to-noise ratio for experimental data. It is also shown that it led to an optimum solution independently of the data fidelity parameter, as long as the number of iterations is properly selected, and that there is a linear relation between the number of iterations and the inverse of the data fidelity parameter. CONCLUSIONS: Split Bregman allows the addition of a nonnegativity constraint leading to improve image quality.